TTKC: A Taylor Triangle K Coverage Algorithm in WSNs
نویسندگان
چکیده
منابع مشابه
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting other nodes in sleep. We divide a target field into multiple grids and make nodes in each grid locally achieve k-coverage. We can reduce energy consumption of WSN by minimizing the number of active nodes required for kc...
متن کاملAn Efficient Recovery Algorithm for Coverage Hole in WSNs
Failures are inevitable in wireless sensor networks, and it is important to detect and patch the “coverage hole”. In this paper, we propose an efficient recovery algorithm based on minimum distance redundant nodes. By numerical algorithm, the sink node gets the centre of the “coverage hole”, and then wakes up a redundant node, which has the minimum distance to the centre, to recover the hole. S...
متن کاملGravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کاملModified Coverage Hole Detection Algorithm for Distributed WSNs
32 32 Abstract— Wireless sensor networks (WSNs) are spatially distributed sensors that find wide applications in various fields such as environmental control, Medicine and Health care, Military surveillance etc. The sensing and communication within the network should be effective for such applications. Holes are the voids created in the network when accidental death of nodes is caused due to te...
متن کاملA Triangle-Triangle Intersection Algorithm
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Generation Communication and Networking
سال: 2016
ISSN: 2233-7857,2233-7857
DOI: 10.14257/ijfgcn.2016.9.6.04